Graph Expression Complexities and Simultaneous Linear Recurrences
نویسندگان
چکیده
The paper investigates relationships between algebraic expressions and graphs. Using the decomposition method we generate special simultaneous systems of linear recurrences for sizes of graph expressions. We propose techniques which provide closed-form solutions for these systems.
منابع مشابه
Simultaneous modeling of multiple recurrences in breast cancer patients
Introduction: Breast cancer is one of the most common recurrence cancers among women. There are several factors that can affect multiple recurrence of this disease. On the other hand, simultaneous examination of the types of relapses will make the results more accurate. The purpose of this study was to use a joint frailty model to model multiple recurrences of breast cancer patients. Materials ...
متن کاملSpanning Trees in Grid Graphs
X iv :0 80 9. 25 51 v1 [ m at h. C O ] 1 5 Se p 20 08 Spanning Trees in Grid Graphs Paul Raff July 25, 2008 Abstract A general method is obtained for finding recurrences involving the number of spanning trees of grid graphs, obtained by taking the graph product of an arbitrary graph and path or cycle. The results in this paper extend the work by Desjarlais and Molina and give concrete methods f...
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملAccelerating the Composite Power System Planning by Benders Decomposition
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...
متن کاملGeneral Techniques for Analyzing Recursive Algorithms with Applications
The complexity of divide-and-conquer algorithms is often described by recurrences of various forms. In this paper, we develop general techniques and master theorems for solving several kinds of recurrences, and we give several applications of our results. In particular, almost all of the earlier work on solving the recurrences considered here is subsumed by our work. In the process of solving s...
متن کامل